Dynamic Slicing Techniques for Petri Nets
نویسندگان
چکیده
منابع مشابه
Dynamic Slicing Techniques for Petri Nets 1
Petri nets provide a means for modelling and verifying the behavior of concurrent systems. Program slicing is a well-known technique in imperative programming for extracting those statements of a program that may affect a given program point. In the context of Petri nets, computing a net slice can be seen as a graph reachability problem. In this paper, we propose two slicing techniques for Petr...
متن کاملSlicing and reduction techniques for model checking Petri nets
Model checking is a method to validate the correct functioning of a piece of hardor software. Specifications are expressed in temporal logic. A model checking algorithm determines automatically whether or not the checked model satisfies a given specification by examining the model’s state space. In their basic form model checking algorithms explore the state space exhaustively. As the number of...
متن کاملSafety Slicing Petri Nets
We define a safety slice as a subnet of a marked Petri net Σ that approximates Σ’s temporal behavior with respect to a set of interesting places Crit. This safety slice can be used to verify and falsify stutter-invariant linear-time safety properties when Crit is the set of places referred to by the safety property. By construction it is guaranteed that the safety slice’s state space is at most...
متن کاملSlicing Petri Nets?
In this paper we introduce the notion of net-slice to describe a subnet of a marked Petri net Σ that approximates Σ’s behaviour in respect to a set of places P . We show that a slice built for the set of atomic propositions of φ enables falsification of φ with φ being an LTL formula or verification of φ with φ being an LTL-X formula, which is an LTL formula built without using the next-time ope...
متن کاملSlicing High-level Petri Nets
High-level Petri nets (evolutions of low-level Petri nets) are well suitable formalisms to represent complex data, which influence the behavior of distributed, concurrent systems. However, usual verification techniques such as model checking and testing remain an open challenge for both (i.e., low-level and high-level Petri nets) because of the state space explosion problem and test case select...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2008
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.12.037